Implementatations of Algorithms For Line-Segment Intersection
نویسنده
چکیده
In this paper, I analyze the constant factors for implementations of line segment intersection algorithms. I explore how these algorithms could be applied to stochastic local search algorithms to determine the rectilinear crossing number of complete graphs.
منابع مشابه
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
We give tail estimates for the efficiency of some randomized incremental algorithms for line segment intersection in the plane. In particular, we show that there is a constant C such that the probability that the running times of algorithms due to Mulmuley [Mul88] and Clarkson and Shor [CS89] exceed C times their expected time is bounded by e ln n)) where n is the number of segments, m is the n...
متن کاملExternal-Memory Algorithms with Applications in GIS
Preface In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this note we survey the recent developments in external-memory algorithms with applications in ...
متن کاملFurther Comparison of Algorithms for Geometric Intersection Problems
The usual rst step in computing an overlay of two vector maps is to determine which pairs of segments (one from each map) intersect so as to perform line-breaking. We identify two classes of algorithms for the segment intersection problem, spatial partitioning and spatial ordering, and we report on implementations of seven algorithms, some known and some new. Though the spatial ordering algorit...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAn Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
متن کامل